import _00GraphFuc as gf

#完全二分图K33不是平面图
m,n=3,3
[V0,V1,E]=gf.completebigraphset(m,n)
V=V0|V1
gf.drawgraph(E)
print(E)
print(len(E)<=3*len(V)-6)
print(len(E)<=2*len(V)-4)